Computing the Galois group of a polynomial
نویسنده
چکیده
This article outlines techniques for computing the Galois group of a polynomial over the rationals, an important operation in computational algebraic number theory. In particular, the linear resolvent polynomial method of [6] will be described.
منابع مشابه
ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملDeciding the nilpotency of the Galois group by computing elements in the centre
We present a new algorithm for computing the centre of the Galois group of a given polynomial f ∈ Q[x] along with its action on the set of roots of f , without previously computing the group. We show that every element in the centre is representable by a family of polynomials in Q[x]. For computing such polynomials, we use quadratic Newton-lifting and truncated expressions of the roots of f ove...
متن کاملGalois Groups of Polynomials Arising from Circulant Matrices
Computing the Galois group of the splitting field of a given polynomial with integer coefficients is a classical problem in modern algebra. A theorem of Van der Waerden [Wae] asserts that almost all (monic) polynomials in Z[x] have associated Galois group Sn, the symmetric group on n letters. Thus, cases where the associated Galois group is different from Sn are rare. Nevertheless, examples of ...
متن کاملA New Bound on Hrushovski's Algorithm for Computing the Galois Group of a Linear Differential Equation
The complexity of computing the Galois group of a linear differential equation is of general interest. In a recent work, Feng gave the first degree bound on Hrushovski’s algorithm for computing the Galois group of a linear differential equation. This bound is the degree bound of the polynomials used in the first step of the algorithm for finding a proto-Galois group (see Definition 2.8) and is ...
متن کاملComputing Galois Groups with Generic Resolvent Polynomials
Given an arbitrary irreducible polynomial f with rational coefficients it is difficult to determine the Galois group of the splitting field of that polynomial. When the roots of f are easy to calculate, there are a number of “tricks” that can be employed to calculate this Galois group. If the roots of f are solvable by radicals, for example, it is often easy to calculate by hand the Q-fixing au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013